Automatic Veriication of Parameterized Linear Networks of Processes

نویسندگان

  • David Lesens
  • Nicolas Halbwachs
  • Pascal Raymond
چکیده

This paper describes a method to verify safety properties of parameterized linear networks of processes. The method is based on the construction of a network invariant , deened as a xpoint. Such invariants can often be automatically computed using heuristics based on Cousot's widening techniques. These techniques have been implemented and some non-trivial examples are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Veriication of Parameterized Networks of Processes by Abstraction

In this paper we are interested in the veriication of safety properties of parameterized networks. A network is deened as a parallel composition of an arbitrary but nite number of identical sequential processes, where we consider parallel composition by interleaving and synchronization by shared variables. Using abstraction techniques, a process, called an abstract network, encoding the behavio...

متن کامل

Abstraction of parameterized networks

In this paper we are interested in the veriication of safety properties of parameter-ized networks. A network is deened as a parallel composition of an arbitrary but nite number of identical sequential processes, where we consider parallel composition by interleaving and synchronization by shared variables. Using abstraction techniques, a process, called an abstract network, encoding the behavi...

متن کامل

Step: Deductive-algorithmic Veriication of Reactive and Real-time Systems ?

The Stanford Temporal Prover, STeP, combines deductive methods with algorithmic techniques to verify linear-time temporal logic speciications of reactive and real-time systems. STeP uses veriication rules, veriication diagrams, automatically generated invariants, model checking, and a collection of decision procedures to verify nite-and innnite-state systems. computer-aided formal veriication o...

متن کامل

Parameterized Veri cation with AutomaticallyComputed Inductive Assertions ?

The paper presents a method, called the method of verii-cation by invisible invariants, for the automatic veriication of a large class of parameterized systems. The method is based on the automatic calculation of candidate inductive assertions and checking for their induc-tiveness, using symbolic model-checking techniques for both tasks. First, we show how to use model-checking techniques over ...

متن کامل

Uppaal | a Tool Suite for Automatic Veriication of Real{time Systems ?

Uppaal is a tool suite for automatic veriication of safety and bounded liveness properties of real-time systems modeled as networks of timed automata. It includes: a graphical interface that supports graphi-cal and textual representations of networks of timed automata, and automatic transformation from graphical representations to textual format, a compiler that transforms a certain class of li...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997